Dynamic Storage Allocation on a Computer with Virtual Memory

نویسنده

  • RICHARD P. BRENT
چکیده

We compare several dynamic storage strategies under the assumption that they will be used on a computer with virtual memory. On such a computer the total (virtual) memory referenced by a process may exceed the actual amount of random-access memory available to the process, and it is usually more important to minimize the number of page faults than the virtual memory required by the process. We show that dynamic storage allocation strategies which work well on computers without virtual memory may exhibit poor paging behaviour in a virtual memory environment. We suggest some new dynamic storage allocation strategies which are intended to mininize the number of page faults while keeping the total (virtual) memory used within reasonable bounds. The new strategies can be implemented efficiently and are preferable to well-known strategies such as the first-fit strategy if the blocks being allocated are appreciably smaller than the page size. Even in the simple case that all blocks are of one fixed size, the new strategies may be preferable to the widely used strategy of keeping a singly-linked list of free blocks and allocating them according to a stack (i.e. last-in, first-out) discipline. Comments Only the Abstract is given here. The full report appeared as [1], and a shorter version appeared as [2].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Virtual Memory Model for Parallel Supercomputers

A model for virtual memory in a distributed memory parallel computer is proposed. It uses a novel parallel computing operating system framework and leads to the definition of two strategies for implementing parallel virtual memory. Careful analysis and simulation results indicate that dynamic page allocation performs better for applications that exhibit some locality of reference of public data...

متن کامل

Virtual Allocation: A Scheme for Flexible Storage Allocation

Traditional file systems allocate and tie up entire storage space at the time the file system is created. This creates a situation where one file system could be running out of space, while another file system has ample unused storage space. In such environment, storage management flexibility is seriously hampered. This paper presents virtual allocation, a scheme for flexible storage allocation...

متن کامل

Scalability of Dynamic Storage Allocation Algorithms

Dynamic storage allocation has a signi cant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage e ciently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the abili...

متن کامل

Don't Stop the BIBOP: Flexible and E cient Storage Management for Dynamically-Typed Languages

This paper describes a storage management system that is exible and eecient. The representation of run-time tags yields fast allocation, type testing, and eld extraction, and the memory model reduces virtual memory paging during garbage collection. The storage management system coexists gracefully with other languages' run-time systems, facilitating the use of multiple languages within a single...

متن کامل

Don’t Stop the BIBOP: Flexible and Efficient Storage Management for Dynamically Typed Languages

This paper describes a storage management system that is flexible and efficient. The representation of run-time tags yields fast allocation, type testing, and field extraction, and the memory model reduces virtual memory paging during garbage collection. The storage management system coexists gracefully with other languages’ run-time systems, facilitating the use of multiple languages within a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1984